No sorting? better searching!
نویسندگان
چکیده
منابع مشابه
No Sorting? Better Searching!
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly meant as the task of arranging keys in increasing or decreasing order with respect to an underlying total order relation. The sorted organization is amenable for searching a set of n keys, since each search requires Θ(...
متن کاملSorting and Searching
This algorithm is appropriately named linear search and has worst-case O(N ) time complexity where N is the length of the input array corresponding to checking every element in the array. While linear search takes advantage of the sequential nature of an array (and in general, any sequential data structure), it does not take full advantage of this property. In particular, if the array is ordere...
متن کاملSearching for better plasmonic materials
Plasmonics is a research area merging the fields of optics and nanoelectronics by confining light with relatively large free-space wavelength to the nanometer scale thereby enabling a family of novel devices. Current plasmonic devices at telecommunication and optical frequencies face significant challenges due to losses encountered in the constituent plasmonic materials. These large losses seri...
متن کاملSearching for better fill-in
Minimum Fill-in is a fundamental and classical problem arising in sparse matrix computations. In terms of graphs it can be formulated as a problem of finding a triangulation of a given graph with the minimum number of edges. By the classical result of Rose, Tarjan, Lueker, and Ohtsuki from 1976, an inclusion minimal triangulation of a graph can be found in polynomial time but, as it was shown b...
متن کاملEfficient Sorting and Searching in Rendering Algorithms
In the proposed tutorial we would like to highlight the connection between rendering algorithms and sorting and searching as classical problems studied in computer science. We will provide both theoretical and empirical evidence that for many rendering techniques most time is spent by sorting and searching. In particular we will discuss problems and solutions for visibility computation, density...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2008
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1328911.1328913